Probabilistic Bigraphs
نویسندگان
چکیده
Bigraphs are a universal computational modelling formalism for the spatial and temporal evolution of system in which entities can be added removed. We extend bigraphs to probabilistic bigraphs, then again action include non-determinism rewards. The extensions implemented BigraphER toolkit illustrated through examples virus spread computer networks data harvesting wireless sensor systems. also supports existing stochastic extension Krivine et al. using we give, first time, direct implementation membrane budding model used motivate bigraphs.
منابع مشابه
Directed Bigraphs
We introduce directed bigraphs, a bigraphical meta-model for describing computational paradigms dealing with locations and resource communications. Directed bigraphs subsume and generalize both original Milner’s and Sassone-Sobociński’s variants of bigraphs. The key novelty is that directed bigraphs take account of the “resource request flow” inside link graphs, from controls to edges (through ...
متن کاملKind Bigraphs
We present a refinement, suggested by Jensen and Milner under the term kind, of pure bigraphs. We name the result kind bigraphs. This refinement generalises the notion of atomic and non-atomic controls, allowing a control to contain a subset of the set of controls. We show that this variation has relative pushouts and classify its idem pushouts. A canonical labelled transition system can be der...
متن کاملPure bigraphs
Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigraphical reactive system (Brs) in which bigraphs can reconfigure themselves. Brss aim to unify process calculi, and to model applications —such as pervasive computing— where locality and mobility are prominent. The paper is devo...
متن کاملSortings & Bigraphs
In this dissertation, we study sortings for reactive and bigraphical reactive systems. Both classes of systems have transitions derived from reactions in such a way that if the category underlying the system in question has sufficient relative pushouts, then bisimulation on the derived transitions will be congruence. It turns out that every application of bigraphical reactive systems in the lit...
متن کاملType Systems for Bigraphs
We propose a novel and uniform approach to type systems for (process) calculi, which roughly pushes the challenge of designing type systems and proving properties about them to the meta-model of bigraphs. Concretely, we propose to define type systems for the term language for bigraphs, which is based on a fixed set of elementary bigraphs and operators on these. An essential elementary bigraph i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2022
ISSN: ['1433-299X', '0934-5043']
DOI: https://doi.org/10.1145/3545180